Degree Bounds for Constrained Pseudo-Triangulations
نویسندگان
چکیده
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S,E). For the case that G forms a simple polygon P with vertex set S we give tight bounds on the vertex degree of TG.
منابع مشابه
Tight degree bounds for pseudo-triangulations of points
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in general position has a minimum pseudo-triangulation whose maximum face degree is four (i.e. each interior face of this pseudo-triangulation has at most four vertices). Both degree bounds are tight. Minimum pseudo-trian...
متن کاملOn numbers of pseudo-triangulations
We study the maximum numbers of pseudo-triangulations and pointed pseudotriangulations that can be embedded over a specific set of points in the plane or contained in a specific triangulation. We derive the bounds O(5.45 ) and Ω(2.41 ) for the maximum number of pointed pseudo-triangulations that can be contained in a specific triangulation over a set of N points. For the number of all pseudo-tr...
متن کاملParity-Constrained Triangulations with Steiner Points
Let P ⊂ R be a set of n points, of which k lie in the interior of the convex hull CH(P) of P . Let us call a triangulation T of P even (odd) if and only if all its vertices have even (odd) degree, and pseudo-even (pseudo-odd) if at least the k interior vertices have even (odd) degree. On the one hand, triangulations having all its interior vertices of even degree have one nice property; their v...
متن کامل3-Colorability of Pseudo-Triangulations
Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. However, for certain classes of plane graphs, like triangulations, polynomial time algorithms exist. We consider the family of pseudo-triangulations (a generalization of triangulations) and prove NP-completeness for this class. The complexity status does not change if the maximum face-degree is bounded to fo...
متن کاملFlip Graphs of Degree-Bounded (Pseudo-)Triangulations⋆
We study flip graphs of (pseudo-)triangulations whose maximum vertex degree is bounded by a constant k. In particular, we consider (pseudo-)triangulations of sets of n points in convex position in the plane and prove that their flip graph is connected if and only if k > 6; the diameter of the flip graph is O(n). We also show that for general point sets flip graphs of minimum pseudo-triangulatio...
متن کامل